A new decoder for the optimum recovery of nonadditive watermarks
نویسندگان
چکیده
Watermark detection, i.e., the detection of an invisible signal hidden within an image for copyright protection or data authentication, has classically been tackled by means of correlation-based techniques. Nevertheless, when watermark embedding does not obey an additive rule, or when the features the watermark is superimposed on do not follow a Gaussian pdf, correlation-based decoding is not the optimum choice. A new decoding algorithm is presented here which is optimum for nonadditive watermarks embedded in the magnitude of a set of full-frame DFT coefficients of the host image. By relying on statistical decision theory, the structure of the optimum is derived according to the Neyman-Pearson criterion, thus permitting to minimize the missed detection probability subject to a given false detection rate. The validity of the optimum decoder has been tested thoroughly to assess the improvement it permits to achieve from a robustness perspective. The results we obtained confirm the superiority of the novel algorithm with respect to classical correlation-based decoding.
منابع مشابه
Optimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling
This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...
متن کاملA Sharp Sufficient Condition for Sparsity Pattern Recovery
Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...
متن کاملRobust optimum detection of transform domain multiplicative watermarks
Digital watermarking is an emerging technique to protect data security and intellectual property right. Identification or verification of watermarking patterns can be achieved by detecting watermarks in received signals. However, one of the biggest challenges in watermarking detection is that the strengths of the watermark signals will change after being distorted by an attacker in a watermarki...
متن کاملOptimum decoding and detection of multiplicative watermarks
This work addresses the problem of optimum decoding and detection of a multibit, multiplicative watermark hosted by Weibull-distributed features: a situation which is classically encountered for image watermarking in the magnitude-of-DFT domain. As such, this work can be seen as an extension of the system described in a previous paper, where the same problem is addressed for the case of 1-bit w...
متن کاملNonadditive Gaussian watermarking and its application to wavelet-based image watermarking
This paper extends our recent game-theoretic approach [1] to design and embed watermarks in Gaussian signals in the presence of an adversary. The detector solves a binary hypothesis testing problem. The system is designed to minimize probability of error under the worst-case attack in a prescribed class of attacks. In this paper, the embedder is allowed to filter the host signal and add a water...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
دوره 10 5 شماره
صفحات -
تاریخ انتشار 2001